Classification of some cosets of the Reed-Muller code

نویسندگان

چکیده

This paper presents a descending method to classify Boolean functions in 7 variables under the action of affine general linear group. The classification determines number classes, set orbits representatives and generator stabilizer each representative. consists iteration process $$RM(k, m)/RM(r-1, m)$$ from that RM(k, m)/RM(r, m). We namely obtain classifications RM(4, 7)/RM(2, 7) RM(7, 7)/RM(3, 7), which we deduce some consequences on covering radius RM(3, near bent functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Cosets of the First-Order Reed-Muller Code with High Minimum Weight

We study a family of particular cosets of the first-order Reed–Muller code R(1;m): those generated by special codewords, the idempotents. Thus we obtain new maximal weight distributions of cosets of R(1; 7) and 84 distinct almost maximal weight distributions of cosets of R(1; 9), that is, with minimum weight 240. This leads to crypotographic applications in the context of stream ciphers.

متن کامل

On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code

It is proved a generalization of Cusick-Cheon’s conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM (k ,m) of order k and length 2m, when k = 1 or k ≥ (m − 1)/2.

متن کامل

Punctured Reed-Muller code-based McEliece cryptosystems

The authors propose new McEliece cryptosystems based on punctured Reed–Muller (RM) codes. They successfully show that the commonly known attacks, such as the Minder–Shokrollahi attack, the Chizhov–Borodin attack, and the square code attack, are ineffective against the proposed RM code-based McEliece cryptosystem. We developed an optimal puncturing scheme to prevent the above-mentioned attacks f...

متن کامل

On the weight distributions of optimal cosets of the first-order Reed-Muller codes

We study the weight distributions of cosets of the first-order Reed–Muller code (1 ) for odd , whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1 ) are obtained by partitioning its words according to their weight divisibility. Most notably, we show that there are exactly five weight distributions ...

متن کامل

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2023

ISSN: ['1936-2455', '1936-2447']

DOI: https://doi.org/10.1007/s12095-023-00652-4